Parallelism in Rendering Algorithms
نویسنده
چکیده
The need for increased computing power for rendering computer imagery is motivated and the sources from which it might de derived surveyed. Increased power can come from parallelism, as well as faster technology, implying new machine architectures and new algorithms. Surveys sketch early att~mpts at using available parallel architectures and look at the limitations and strengths of some existing architectures. Finally, potential parallel algorthms for the rendering process are sketched including rough analyses of potential performance bottlenecks.
منابع مشابه
Massively Parallel Visualization: Parallel Rendering
This paper presents rendering algorithms, developed for massively parallel processors (MPPs), for polygonal, spheres, and volumetric data. The polygon algorithm uses a data parallel approach whereas the sphere and volume renderer use a MIMD approach. Implementations for these algorithms are presented for the Thinking Machines Corporation CM-5 MPP.
متن کاملParallel Rendering – Fast Graphics
This seminar paper briefly reviewed and discussed the basic concepts of parallel rendering in computer graphics, the importance of parallel rendering, and the different types of rendering parallelism. The paper also explored the algorithms in parallel rendering and compared the advantages and disadvantages of the sort-first, sort-middle and sort-last algorithm.
متن کاملTigerSHARK A Hardware Accelerated Ray-tracing Engine
The current state of the art in graphics rendering algorithms and hardware is surveyed, and it is shown that ray-tracing, despite larger computational requirements than conventional algorithms, is more amenable to massive parallelism. The TigerSHARK ray-tracing architecture is then presented as an extremely cost-effective means to exploit this fundamental parallelism. A competing approach is an...
متن کاملParallel Considerations for Real-time Volume Rendering
Current technology dictates that parallel processing is required to perform real-time volume rendering for any signi cant data set sizes and image qualities. This paper compares parallel architectures and algorithms which perform volume rendering, as well as a few alternative architectures not previously applied to the volume rendering problem. Since the memory to processor bandwidth is the maj...
متن کاملIrregular Grid Volume Rendering With Composition Networks
tetrahedral cell, parallel rendering, parallel compositing, PixelFlow Volumetric irregular grids are the next frontier to conquer in interactive 3D graphics. Visualization algorithms for rectilinear 2563 data volumes have been optimized to achieve one frame/second to 15 frames/second depending on the workstation. With equivalent computational resources, irregular grids with millions of cells ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015